We address the problem of belief revision of logic programs, i.e., how toincorporate to a logic program P a new logic program Q. Based on the structureof SE interpretations, Delgrande et al. adapted the well-known AGM framework tologic program (LP) revision. They identified the rational behavior of LPrevision and introduced some specific operators. In this paper, a constructivecharacterization of all rational LP revision operators is given in terms oforderings over propositional interpretations with some further conditionsspecific to SE interpretations. It provides an intuitive, complete procedurefor the construction of all rational LP revision operators and makes easier thecomprehension of their semantic and computational properties. We give aparticular consideration to logic programs of very general form, i.e., thegeneralized logic programs (GLPs). We show that every rational GLP revisionoperator is derived from a propositional revision operator satisfying theoriginal AGM postulates. Interestingly, the further conditions specific to GLPrevision are independent from the propositional revision operator on which aGLP revision operator is based. Taking advantage of our characterizationresult, we embed the GLP revision operators into structures of Booleanlattices, that allow us to bring to light some potential weaknesses in theadapted AGM postulates. To illustrate our claim, we introduce and characterizeaxiomatically two specific classes of (rational) GLP revision operators whicharguably have a drastic behavior. We additionally consider two more restrictedforms of logic programs, i.e., the disjunctive logic programs (DLPs) and thenormal logic programs (NLPs) and adapt our characterization result to DLP andNLP revision operators.
展开▼
